A particle swarm optimization approach for permutation flow shop scheduling problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem

In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...

متن کامل

An Immune Particle Swarm Optimization Method for Permutation Flow Shop Scheduling Problem

Permutation Flow Shop Scheduling Problem (PFSP) is a complex combinatorial optimization problem with strong engineering background. To solve the PFSP with makespan criterions, an immune particle swarm optimization (IPSO) algorithm was proposed. The initial solution of the algorithm is generated by the famous heuristic NEH algorithm, it was used to initialize the particle of global extreme value...

متن کامل

Cat swarm optimization for solving the open shop scheduling problem

This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...

متن کامل

A New Cooperative Particle Swarm Optimizer and its Application in Permutation Flow Shop Scheduling Problem

In this study, a new variant of Particle Swarm Optimization, Electoral Cooperative PSO (ECPSO), is presented and applied into solving the Permutation Flow Shop Scheduling Problem (PFSSP). Firstly, an electoral swarm is generated by the voting of primitive sub-swarms and also participates in evolution of swarm, whose particle candidates come from primitive sub-swarms with variable votes from the...

متن کامل

A Niche Sharing Scheme-based Co-evolutionary Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem

By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal for Simulation and Multidisciplinary Design Optimization

سال: 2014

ISSN: 1779-627X,1779-6288

DOI: 10.1051/smdo/2013006